K-processor Scheduling
نویسندگان
چکیده
It is shown that the Precedence Constrained K-Processor Scheduling problem is W2]-hard. This means that there does not exist a constant c, such that for all xed K, the Precedence Constrained K-Processor Scheduling problem can be solved in O(n c) time, unless an unlikely collapse occurs in the parameter-ized complexity hierarchy introduced by Downey and Fellows (see 5]). That is, if the problem can be solved in polynomial time for each xed K, then it is likely that the degree of the running time polynomial must increase as the number of processors K increases.
منابع مشابه
Modeling and scheduling no-idle hybrid flow shop problems
Although several papers have studied no-idle scheduling problems, they all focus on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops by duplicating machines in parallel in stages. This paper considers the problem of scheduling no-idle hybrid flow shops. A mixed integer linear programming model is first developed to mathematically form...
متن کاملA Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints
One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...
متن کاملW[2]-hardness of precedence constrained K-processor scheduling
It is shown that the Precedence Constrained K-Processor Scheduling problem is W [2]-hard. This means that there does not exist a constant c, such that for all xed K, the Precedence Constrained K-Processor Scheduling problem can be solved in O(nc) time, unless an unlikely collapse occurs in the parameterized complexity hierarchy introduced by Downey and Fellows (see [5]). That is, if the problem...
متن کاملProcessor Allocation and Task Scheduling of Matrix ChainProducts on Parallel
The problem of nding an optimal product sequence for sequential multiplication of a chain of matrices (the matrix chain ordering problem, MCOP) is well-known and has been studied for a long time. In this paper, we consider the problem of nding an optimal product schedule for evaluating a chain of matrix products on a parallel computer (the matrix chain scheduling problem, MCSP). The diierence b...
متن کاملDual-Token-Based Fault-Tolerant Scheduling for Hard Real-Time Multiprocessor Systems
Real-time multiprocessor systems frequently assume that there exists a dedicated processor for task allocation that never fails. This assumption is, however, too strong in the sense that all the physical objects are subject to failure. Moreover, once the dedicated processor fails, the whole multiprocessor system will fail. As a way to solve this problem, we propose a fault-tolerant scheduling a...
متن کامل